Non-Centralized Distinct L-Diversity
نویسندگان
چکیده
منابع مشابه
Privacy-Preservation of Centralized and Distributed Social Network by Using L-Diversity Algorithm
Publishing data about individuals without revealing sensitive information about them is an important problem. In recent years, a new definition of privacy called k-anonymity has gained popularity. In a k-anonymized dataset, each record is indistinguishable from at least k−1 other records with respect to certain “identifying” attributes. The problem of Social Network is getting secured data from...
متن کاملDistinct Failure Diversity in Multiversion Software
In earlier studies of multiversion programming, both empirical and analytical, emphasis switched from notions of independence to one of minimization of coincident failure. We show that neither independence of failure, nor lack of coincident failure are the single important properties. Indeed, an N-version system may deliver an optimal performance (under some voting strategy) even when the incid...
متن کاملData Security Using L Diversity
The large amount of data is used in corporate and government institution. The sequence of releases is more identify by adversary. So, the user’s privacy is violated. To avoid this to use privacy protection techniques are applied here. Privacy preserving serial data publishing on dynamic databases has relied on unrealistic assumptions of the nature of dynamic databases. In many applications, som...
متن کاملSuppression Slicing – using l-diversity
An important problem in publishing the data is privately held data about individuals without revealing the sensitive information about them. Several anonymization techniques, such as suppression, bucketization and slicing have been designed for privacy preservation in microdata publishing. Suppression involves not releasing a value at all it leads to the utility loss while the anonymized table ...
متن کاملNon-centralized Predictive Control for Drinking Water Supply Systems
This chapter discusses the application of non-centralized MPC (NCMPC) approaches to DWTNs. The aim of DMPC is to reduce the computational burden and to increase scalability and modularity with respect to the centralised counterpart, but still maintaining a convenient level of suboptimality with respect to the desired control objectives. Moreover, the advantage of NCMPC approach is the simplicit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Database Management Systems
سال: 2012
ISSN: 0975-5985
DOI: 10.5121/ijdms.2012.4201